A Action-based Heuristics for Effective Planning
نویسندگان
چکیده
منابع مشابه
Interval Based Relaxation Heuristics for Numeric Planning with Action Costs
Many real-world problems can be expressed in terms of states and actions that modify the world to reach a certain goal. Such problems can be solved by automated planning. Numeric planning supports numeric quantities such as resources or physical properties in addition to the propositional variables from classical planning. We approach numeric planning with heuristic search and introduce adaptat...
متن کاملHeuristics for Planning with Action Costs Revisited
We introduce a simple variation of the additive heuristic used in the HSP planner that combines the benefits of the original additive heuristic, namely its mathematical formulation and its ability to handle non-uniform action costs, with the benefits of the relaxed planning graph heuristic used in FF, namely its compatibility with the highly effective enforced hill climbing search along with it...
متن کاملHeuristics for Planning with Action Costs
We introduce a non-admissible heuristic for planning with action costs, called the set-additive heuristic, that combines the benefits of the additive heuristic used in the HSP planner and the relaxed plan heuristic used in FF. The set-additive heuristic ha is defined mathematically and handles non-uniform action costs like the additive heuristic ha, and yet like FF’s heuristic hFF, it encodes t...
متن کاملPlanning Graph Based Heuristics for Automated Planning
One of the most successful algorithms in the last few years for solving classical planning problems is Graphplan [3]. This algorithm can be seen as a disjunctive version of forward state space planners. The algorithm has two interleaved phases: a forward phase where a polynomial-time data structure called ”planning graph” is incrementally extended, and a backward phase where that planning graph...
متن کاملEffective Heuristics and Belief Tracking for Planning with Incomplete Information
Conformant planning can be formulated as a path-finding problem in belief space where the two main challenges are the heuristics to guide the search, and the representation and update of beliefs. In the translation-based approach recently introduced by Palacios and Geffner, the two aspects are handled together by translating conformant problems into classical ones that are solved with classical...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korea Academia-Industrial cooperation Society
سال: 2015
ISSN: 1975-4701
DOI: 10.5762/kais.2015.16.9.6290